منابع مشابه
Flag Bicolorings, Pseudo-Orientations, and Double Covers of Maps
This paper discusses consistent flag bicolorings of maps, in their own right and as generalizations of orientations and pseudo-orientations. Furthermore, a related doubling concept is introduced, and relationships between these ideas are explored.
متن کاملMinsquare Factors and Maxfix Covers of Graphs
We provide a polynomial algorithm that determines for any given undirected graph, positive integer k and various objective functions on the edges or on the degree sequences, as input, k edges that minimize the given objective function. The tractable objective functions include linear, sum of squares, etc. The source of our motivation and at the same time our main application is a subset of k ve...
متن کاملFlag Bicolorings , Pseudo - Orientations , and Double Covers of Maps . Hiroki Koike
This paper discusses consistent flag bicolorings of maps and maniplexes, in their own right and as generalizations of orientations and pseudo-orientations. Furthermore, a related doubling concept is introduced, and relationships between these ideas are explored.
متن کاملproficiency level and factors fostering reticence in efl learners
according to cheng (1999), in recent esl/efl literature, asian (especially east asian) learners of english as a foreign/second language have been arguably reported as reticent and passive learners. the most common allegations are that these students are reluctant to participate in classroom discourse; they are unwilling to give responses; they do not ask questions; and they are passive and over...
15 صفحه اولApproximate Generalized Matching: $f$-Factors and $f$-Edge Covers
In this paper we present linear time approximation schemes for several generalized matching problems on nonbipartite graphs. Our results include O (m)-time algorithms for (1 − )maximum weight f -factor and (1+ )-approximate minimum weight f -edge cover. As a byproduct, we also obtain direct algorithms for the exact cardinality versions of these problems running in O(m √ f(V )) time. The technic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2020
ISSN: 1077-8926
DOI: 10.37236/8767